Multipoint linear approximations for stochastic chance constrained optimization problems with integer design variables

نویسندگان

  • L. F. P. Etman
  • S. J. Abspoel
  • J. Vervoort
  • R. A. van Rooij
  • J. J. M Rijpkema
  • J. E. Rooda
چکیده

In multidisciplinary analysis and optimization response surface approximations are frequently applied. An important reason is that response surface techniques provide a convenient representation of data from one discipline to other disciplines [1]. In each discipline usually one or more computationally expensive computer simulation models are involved. The response surface approximations are used to alleviate the computational burden of the optimization and circumvent discontinuities or noisy responses that are encountered. They also enable to deal in a practical way with discrete design variables: the discete optimization problem can be solved on the approximate optimization level which avoids a combinatorial increase of the number of numerical analyses (see e.g. [2]). The computational burden becomes even larger if the system behaves stochastic instead of deterministic. One may think of analysis for reliability or discrete-event simulation, where stochastic distributions are part of the modeling. In that case the stochasticity has to be accounted for during the optimization. Response surface techniques have their origin in physical experimentation and are therefore especially suitable to build deterministic approximate optimization subproblems from stochastic data. The optimum of the deterministic approximate subproblem then has to be evaluated in a statistical sense with respect to feasibility and change of objective function value. If no further information is available on the actual distributions, a statistical evaluation usually requires several replications of the numerical analysis of the proposed approximate optimum design. This paper addresses integer optimization problems with stochastic objective function and constraints. Starting point is a sequential approximate optimization approach, where response-surface techniques are employed to build multipoint linear approximations of objective function and constraints in search subregions of the design space. The research question is whether such an approach is able to solve a stochastic integer optimization problem in a practical valuable way within a manageable number of computer simulations. The focus of this paper lies on optimization problems with so-called chance constraints. This type of constraints typically arise for structures, such as aircraft, where conditions on, for example, reliability are included.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning

The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...

متن کامل

On distributionally robust joint chance-constrained problems

Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...

متن کامل

Decomposition algorithms for two-stage chance-constrained programs

We study a class of chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. In addition, we propose a new model, where “recovery” decisions are made for the infeasible scenarios to obtain feasible solutions to a relaxed second-stage problem. We develop decomposition algorithms with specialized optimality and feasibility...

متن کامل

On deterministic reformulations of distributionally robust joint chance constrained optimization problems

A joint chance constrained optimization problem involves multiple uncertain constraints, i.e., constraints with stochastic parameters, that are jointly required to be satisfied with probability exceeding a prespecified threshold. In a distributionally robust joint chance constrained optimization problem (DRCCP), the joint chance constraint is required to hold for all probability distributions o...

متن کامل

Chance-Constrained Programming Models and Approximation Algorithms for General Stochastic Bottleneck Spanning Tree Problems

This paper considers a balance-constrained stochastic bottleneck spanning tree problem (BCSBSTP) in which edge weights are independently distributed but may follow arbitrary random distributions. The problem minimizes a scalar and seeks a spanning tree, of which the maximum edge weight is bounded by the scalar for a given certain probability, and meanwhile the minimum edge weight is lower bound...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000